منابع مشابه
Boulevard du Triomphe
In this paper, we show how to split the writhe of reduced projections of oriented alternating links into two parts, called nullification writhe, or wx, and remaining writhe, or wy, such that the sum of these quantities equals the writhe w, and each quantity remains an invariant of isotopy. The chirality of oriented alternating links can be detected by a non-zero wx or wy, which constitutes an i...
متن کاملA walk on sunset boulevard
A walk on sunset boulevard can teach us about transcendental functions associated to Feynman diagrams. On this guided tour we will see multiple polylogarithms, differential equations and elliptic curves. A highlight of the tour will be the generalisation of the polylogarithms to the elliptic setting and the all-order solution for the sunset integral in the equal mass case.
متن کاملMinimum-link watchman tours
We consider the problem of computing a watchman route in a polygon with holes. We show that the problem of finding a minimum-link watchman route is NP-complete, even if the holes are all convex. The proof is based on showing that the related problem of finding a minimum-link tour on a set of points in the plane is NP-complete. We provide a provably good approximation algorithm that achieves an ...
متن کاملFigurative Tours and Braids
We start with a rectangular grid of points, and we connect pairs of points to form either a tour (a Hamiltonian cycle) or a braid (a collection of disjoint paths that start in the top row and end on the bottom). In each case, our goal is to design a graph that will closely resemble a grayscale target image when viewed from a distance. From up close, the graph will look like an abstract pattern....
متن کاملGood triangulations yield good tours
Consider the following heuristic for planar Euclidean instances of the traveling salesman problem (TSP): select a subset of the edges which induces a planar graph, and solve either the TSP or its graphical relaxation on that graph. In this paper, we give several motivations for considering this heuristic, along with extensive computational results. It turns out that the Delaunay and greedy tria...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ADLFI. Archéologie de la France - Informations
سال: 2015
ISSN: 2114-0502
DOI: 10.4000/adlfi.14173